A constructive Borel–Cantelli lemma. Constructing orbits with required statistical properties
نویسندگان
چکیده
منابع مشابه
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets Ai with effectively summable measures, there are computable points which are not contained in infinitely many Ai. As a consequence of this we obtain the existence of computable points which follow the typical statist...
متن کاملAn effective Borel-Cantelli Lemma. Constructing orbits with required statistical properties
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (recursive in some way) of sets A i with recursively summable measures , there are computable points which are not contained in infinitely many A i. As a consequence of this we obtain the existence of computable points which follow the typical statist...
متن کاملConstructive Lovasz Local Lemma
Let V be a finite set of independent random variables, and let A denote a finite set of events that are determined by V . That is, each event A ∈ A maps the set of assignments of V to {0, 1}. Definition 1. Given the set of independent random variables V and set of events A determined by the variables of V , define the relevant variables for an event A ∈ A, denoted vbl(A) ⊂ V to be the smallest ...
متن کاملA Constructive Lovász Local Lemma for Permutations
While there has been significant progress on algorithmic aspects of the Lovász Local Lemma (LLL) in recent years, a noteworthy exception is when the LLL is used in the context of random permutations. The breakthrough algorithm of Moser & Tardos only works in the setting of independent variables, and does not apply in this context. We resolve this by developing a randomized polynomial-time algor...
متن کاملConstructive Proof of Lovász Local Lemma
Let A be a finite collection of mutually independent “bad” events (ones we wish to avoid) in a probability space Ω. The probability of none of these events happening is exactly ∏ A∈A(1−Pr [A]). In particular, this probability is positive whenever no event in A has probability 1. What if the events in A are not mutually independent but has limited dependence? Let Γ(A) ⊆ A be the subset of events...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.02.010